Reversing Algebraic Process Calculi
نویسندگان
چکیده
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We formulate a procedure for converting operators of standard algebraic process calculi such as CCS, ACP and CSP into reversible operators, while preserving their operational semantics.
منابع مشابه
Mathematical Structures in Computer Science Higherorder Psicalculi Higher-order Psi-calculi †
In earlier work we explored the expressiveness and algebraic theory Psi-calculi, which form a parametric framework for extensions of the pi-calculus. In the current paper we consider higher-order psi-calculi through a technically surprisingly simple extension of the framework, and show how an arbitrary psi-calculus can be lifted to its higher-order counterpart in a canonical way. We illustrate ...
متن کاملWhat is Algebraic in Process Theory?
This is an extended version of an essay with the same title that I wrote for the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, held in Bertinoro, Italy in the first week of August 2005.
متن کاملCasl Specifications of Qualitative Calculi
In AI a large number of calculi for efficient reasoning about spatial and temporal entities have been developed. The most prominent temporal calculi are the point algebra of linear time and Allen’s interval calculus. Examples of spatial calculi include mereotopological calculi, Frank’s cardinal direction calculus, Freksa’s double cross calculus, Egenhofer and Franzosa’s intersection calculi, an...
متن کاملA Process Algebra for Optimization for Parallel Programs
We propose a theoretical framework for the performance analysis and optimization of parallel programs through an algebraic relation on expressions in a time-extended process calculus. The relation is an extension of bisimulation and is characterized by having the ability to order behaviorally equivalent communicating processes with respect to their relative speeds, and have some useful algebrai...
متن کاملConfluence via strong normalisation in an algebraic lambda-calculus with rewriting
The linear-algebraic λ -calculus and the algebraic λ -calculus are untyped λ -calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic λ -calculi are not confluent unless further restrictions are added. We provide a type system for the linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006